package com.chb.recursion;

/**
 * 198. 打家劫舍 https://leetcode-cn.com/problems/house-robber/
 *
 */
public class Rob {
    public static void main(String[] args) {
        int[] nums = new int[]{1,2,3,1};
        int money = new Rob().rob(nums);
        System.out.println("max money = " + money);
    }

    public int rob(int[] nums) {
        if (nums.length == 0) return 0;
        if (nums.length == 1) return nums[0];
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            // dp[n] = max(dp[n-2] + nums[n], dp[i-1])
            dp[i] = Math.max(dp[i-2]+nums[i], dp[i-1]);
        }
        return dp[nums.length-1];
    }
}
